Pseudo-Sylvester domains and skew laurent polynomials over firs

نویسندگان

چکیده

Building on recent work of Jaikin-Zapirain, we provide a homological criterion for ring to be pseudo-Sylvester domain, that is, admit division fractions over which all stably full matrices become invertible. We use the study skew Laurent polynomial rings free ideal (firs). As an application our methods, prove crossed products with free-by-{infinite cyclic} and surface groups are domains unconditionally Sylvester if only they cancellation. This relies proof Farrell–Jones conjecture normally poly-free extends previous results Linnell–Lück Jaikin-Zapirain universal localizations fields such products.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Undecidability in Matrices over Laurent Polynomials

We show that it is undecidable for finite sets S of upper triangular 4 × 4matrices over Z[x, x−1] whether or not all elements in the semigroup generated by S have a nonzero constant term in some of the Laurent polynomials of the first row. This result follows from a representations of the integer weighted finite automata by matrices over Laurent polynomials.

متن کامل

Decompositions of Laurent Polynomials

In the 1920’s, Ritt studied the operation of functional composition g ◦ h(x) = g(h(x)) on complex rational functions. In the case of polynomials, he described all the ways in which a polynomial can have multiple ‘prime factorizations’ with respect to this operation. Despite significant effort by Ritt and others, little progress has been made towards solving the analogous problem for rational fu...

متن کامل

Multivariate Positive Laurent Polynomials

Recently Dritschel proves that any positive multivariate Laurent polynomial can be factorized into a sum of square magnitudes of polynomials. We first give another proof of the Dritschel theorem. Our proof is based on the univariate matrix Féjer-Riesz theorem. Then we discuss a computational method to find approximates of polynomial matrix factorization. Some numerical examples will be shown. F...

متن کامل

Laurent Polynomials and Superintegrable Maps

This article is dedicated to the memory of Vadim Kuznetsov, and begins with some of the author’s recollections of him. Thereafter, a brief review of Somos sequences is provided, with particular focus being made on the integrable structure of Somos-4 recurrences, and on the Laurent property. Subsequently a family of fourth-order recurrences that share the Laurent property are considered, which a...

متن کامل

Laurent polynomials and Eulerian numbers

Article history: Received 24 August 2009 Available online 25 February 2010

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra and Its Applications

سال: 2021

ISSN: ['1793-6829', '0219-4988']

DOI: https://doi.org/10.1142/s0219498822501687